Concentrations, Load Balancing, Multicasting and Partial Permutation Routing on Hypercube Parallel Computers
نویسندگان
چکیده
GENE EU JAN, FRANKYEONG-SUNG LIN, MING-BO LIN AND DERON LIANG Department of Computer Science National Taiwan Ocean University Keelung, 202 Taiwan E-mail: {B0199, drliang}@mail.ntou.edu.tw Department of Information Management National Taiwan University Taipei, 106 Taiwan Department of Electronic Engineering National Taiwan University of Science and Technology Taipei, 106 Taiwan E-mail: [email protected]
منابع مشابه
A Review On 3-Tier Multicasting Routing Protocol In Manets
In this paper, multicast routing protocol namely Hypercube based Team Multicast Routing Protocol (HTMRP) has been proposed to address the scalability in mobile ad hoc networks In HTMRP team multicasting is proposed where the multicast group does not consist of individuals rather, member teams. This mechanism is common in ad hoc networks to accomplish collective tasks such as emergency recovery,...
متن کاملOptimal Multicast Tree Routing for Cluster Computing in Hypercube Interconnection Networks
* This work was partially sponsored by Research Grant Council (RGC) of the Hong Kong under grants No. CityU1076/00E and CityU1055/01E. Abstract This paper proposes a set of novel efficient multicast routing algorithms on hypercube interconnection of cluster computers using multicast shared tree approach. We present some new algorithms for selecting an optimal core (root) for constructing the sh...
متن کاملLoad Balancing in the Fine-Grained Object-Oriented Language Ellie
This position paper presents the main goals of the Ellie project which have been to design and implement a general, powerful, fine-grained, object-oriented, programming language intended for machine independent programming of distributed memory parallel computers. The implementation includes operating system facilities for message routing and load balancing. The main subject of this paper is lo...
متن کاملA Perfect Load Balancing Algorithm on Cube-Connected Cycles
A simple yet efficient algorithm was presented by Jan and Huang recently to distribute loads evenly on multiprocessor computers with hypercube interconnection networks. That algorithm was developed based on the well-known dimension exchange method. However, the error accumulation suffered by other algorithms based on the dimension exchange method is avoided by exploiting the notion of regular d...
متن کاملBalanced Parallel Sort on Hypercube Multiprocessors
A parallel sorting algorithm for sorting n elements evenly distributed over Z d = p nodes of a d-dimensional hypercube is presented. The average running time of the algorithm is O( ( n log n)/p + p log2 n). The algorithm maintains a perfect load balance in the nodes by determining the (kn/p)th elements (k = 1,. . . , ( p 1)) of the final sorted list in advance. These p 1 keys are used to partit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 18 شماره
صفحات -
تاریخ انتشار 2002